Transfer Function Synthesis without Quantifier Elimination
نویسندگان
چکیده
منابع مشابه
Transfer Function Synthesis without Quantifier Elimination
Abstract. Traditionally, transfer functions have been designed manually for each operation in a program, instruction by instruction. In such a setting, a transfer function describes the semantics of a single instruction, detailing how a given abstract input state is mapped to an abstract output state. The net effect of a sequence of instructions, a basic block, can then be calculated by composi...
متن کاملQuantifier Elimination
Quantifier elimination (QE) is a very powerful procedure for problems involving firstorder formulas over real fields. The cylindrical algebraic decomposition (CAD) is a technique for the “efficient” im plementation of QE, that effectively reduces an seemingly infinite problem into a finite (but potentially large) instance. For much more information about QE and CAD (including a reprint of Tar...
متن کاملQuantifier Elimination for Quartics
Concerning quartics, two particular quantifier elimination (QE) problems of historical interests and practical values are studied. We solve the problems by the theory of complete discrimination systems and negative root discriminant sequences for polynomials that provide a method for real (positive/negative) and complex root classification for polynomials. The equivalent quantifier-free formula...
متن کاملQuantifier Elimination in Fields
Here we give a detailed description of the quantifier elimination algorithm for algebraically closed fields (ACF); We also describe its implementation in the system AFC-EQ that was developed in GIS Group for Inteligent Systems on the Faculty of Mathematics, University of Belgrade.
متن کاملPartial Quantifier Elimination
We consider the problem of Partial Quantifier Elimination (PQE). Given formula ∃X[F (X,Y ) ∧G(X,Y )], where F,G are in conjunctive normal form, the PQE problem is to find a formula F ∗(Y ) such that F ∗ ∧ ∃X[G] ≡ ∃X[F ∧G]. We solve the PQE problem by generating and adding to F clauses over the free variables that make the clauses of F with quantified variables redundant in ∃X[F ∧G]. The traditi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logical Methods in Computer Science
سال: 2012
ISSN: 1860-5974
DOI: 10.2168/lmcs-8(3:17)2012